Flynn's taxonomy

Flynn's taxonomy
  Single instruction Multiple instruction
Single data SISD MISD
Multiple data SIMD MIMD

Flynn's taxonomy is a classification of computer architectures, proposed by Michael J. Flynn in 1966.[1][2]

Contents

Classifications

The four classifications defined by Flynn are based upon the number of concurrent instruction (or control) and data streams available in the architecture:

Single Instruction, Single Data stream (SISD)
A sequential computer which exploits no parallelism in either the instruction or data streams. Single control unit (CU) fetches single Instruction Stream (IS) from memory. The CU then generates appropriate control signals to direct single processing element (PE) to operate on single Data Stream (DS) i.e. one operation at a time

Examples of SISD architecture are the traditional uniprocessor machines like a PC (currently manufactured PCs have multiple processors) or old mainframes.

Single Instruction, Multiple Data streams (SIMD)
A computer which exploits multiple data streams against a single instruction stream to perform operations which may be naturally parallelized. For example, an array processor or GPU.
Multiple Instruction, Single Data stream (MISD)
Multiple instructions operate on a single data stream. Uncommon architecture which is generally used for fault tolerance. Heterogeneous systems operate on the same data stream and must agree on the result. Examples include the Space Shuttle flight control computer.
Multiple Instruction, Multiple Data streams (MIMD)
Multiple autonomous processors simultaneously executing different instructions on different data. Distributed systems are generally recognized to be MIMD architectures; either exploiting a single shared memory space or a distributed memory space.

Diagram comparing classifications

Visually, these four architectures are shown below where each "PU" is a processing unit:

SISD MISD
SIMD MIMD

Further divisions

As of 2006, all the top 10 and most of the TOP500 supercomputers are based on a MIMD architecture.

Some further divide the MIMD category into the following categories:[3][4][5][6][7]

Single Program, Multiple Data (SPMD)
Multiple autonomous processors simultaneously executing the same program (but at independent points, rather than in the lockstep that SIMD imposes) on different data. Also referred to as 'Single Process, multiple data'[8] - the use of this terminology for SPMD is erroneous and should be avoided, SPMD is a parallel execution model and assumes multiple cooperating processes executing a program. SPMD is the most common style of parallel programming [9]. The SPMD model and the term was proposed by Frederica Darema[10]. Gregory F. Pfister was a manager of the RP3 project, and Darema was part of the RP3 team.
Multiple Program Multiple Data (MPMD)
Multiple autonomous processors simultaneously operating at least 2 independent programs. Typically such systems pick one node to be the "host" ("the explicit host/node programming model") or "manager" (the "Manager/Worker" strategy), which runs one program that farms out data to all the other nodes which all run a second program. Those other nodes then return their results directly to the manager. An example of this would be the Sony PlayStation 3 game console, with its SPU/PPU processor architecture.

Even further subdivisions are sometimes considered.[11]

References

  1. ^ Flynn, M. (1972). "Some Computer Organizations and Their Effectiveness". IEEE Trans. Comput. C-21: 948. 
  2. ^ Duncan, Ralph (1990). "A Survey of Parallel Computer Architectures". IEEE Computer: 5–16. 
  3. ^ http://www.llnl.gov/casc/Overture/henshaw/documentation/App/manual/node36.html
  4. ^ http://www.cisl.ucar.edu/docs/lightning/program.jsp
  5. ^ http://web0.tc.cornell.edu/Services/Education/Topics/Parallel/Design/SPMD.aspx
  6. ^ http://math.nist.gov/~KRemington/Primer/distrib.html
  7. ^ http://www.cisl.ucar.edu/docs/ibm/ref/parallel.html
  8. ^ http://www.cisl.ucar.edu/docs/ibm/ref/parallel.html
  9. ^ http://www.nist.gov/dads/HTML/singleprogrm.html
  10. ^ Darema, Frederica; George, David A.; Norton, V. Alan & Pfister, Gregory F. (1988). "A single-program-multiple-data computational model for epex fortran". Parallel Computing 7: 11–24. 
  11. ^ http://www.tc.cornell.edu/Services/Education/Topics/Parallel/Distributed/+9.2+Strategies.htm

This article was originally based on material from the Free On-line Dictionary of Computing, which is licensed under the GFDL.

External links